Exact and Approximation Algorithms for Densest k-Subgraph
نویسندگان
چکیده
The densest k-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of densest k-subgraph improving the standard exponential time complexity of O∗(2n) and using polynomial space. Two FPT algorithms are also proposed; the first considers as parameter the treewidth of the input graph and uses exponential space, while the second is parameterized by the size of the minimum vertex cover and uses polynomial space. Finally, we propose several approximation algorithms running in moderately exponential or parameterized time.
منابع مشابه
Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Juin 2012 Exact and approximation algorithms for DENSEST k - SUBGRAPH
The densest k-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of densest k-subgraph improving the standard exponential time complexity of O * (2 n) and using polyn...
متن کاملThe Densest k-Subhypergraph Problem
The Densest k-Subgraph (DkS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed th...
متن کاملSDP-Hardness of Approximation for Densest k-subgraph
Densest k-subgraph is the problem of finding, giving a graph G and a number k, a k vertex subgraph of G with as many edges as possible. The best known poly-time algorithm for this problem gives a factor n1/4 approximation. Proving even constant factor hardness of approximation results for this problem has been done only with significantly stronger assumptions that P , NP. In 2011, however, Bhas...
متن کاملApproximation schemes, cliques, colors and densest subgraphs
In this thesis we study the problem of finding the densest k-subgraph of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, we study polynomial time algorithms for the densest k-subgraph problem on weighted graphs of maximal degree two, on weighted trees even if the solution is disconnected, and on interval...
متن کاملFinding large and small dense subgraphs
We consider two optimization problems related to finding dense subgraphs, which are induced subgraphs with high average degree. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (DamkS) is defined similarly. These problems are related to the well-known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013